Cost Recurrences for DML Programs
نویسندگان
چکیده
منابع مشابه
Detection of Recurrences in Sequential Programs with Loops
To improve the performances of parallelizing compilers, one must detect recurrences in scientiic programs and subject them to special parallelization methods. We present a method for detecting recurrences which is based on the analysis of Systems of Recurrence Equations. This method identiies recurrences on arrays, recurrences of arbitrary order and multi-equations recurrences. We explain how t...
متن کاملComputing Programs Containing Band Linear Recurrences on Vector Supercomputers
Many large-scale scienti c and engineering computations, e.g., some of the Grand Challenge problems [1], spend a major portion of execution time in their core loops computing band linear recurrences (BLR's). Conventional compiler parallelization techniques [4] cannot generate scalable parallel code for this type of computation because they respect loop-carried dependences (LCD's) in programs an...
متن کاملCost-Benefit Analysis for Juvenile Justice Programs
This is one of a series of briefings prepared by the Justice Research and Statistics Association under the Juvenile Justice Evaluation Center (JJEC) project. The purpose of this briefing series is to provide juvenile justice program managers with information that will help them evaluate their programs. Each briefing addresses a topic that is of particular interest to juvenile justice program ma...
متن کاملAutomatic Static Cost Analysis for Parallel Programs
Static analysis of the evaluation cost of programs is an extensively studied problem that has many important applications. However, most automatic methods for static cost analysis are limited to sequential evaluation while programs are increasingly evaluated on modern multicore and multiprocessor hardware. This article introduces the first automatic analysis for deriving bounds on the worst-cas...
متن کاملLower Bound Cost Estimation for Logic Programs
It is generally recognized that information about the runtime cost of computations can be useful for a variety of applications, including program transformation, granularity control during parallel execution, and query optimization in deductive databases. Most of the work to date on compile-time cost estimation of logic programs has focused on the estimation of upper bounds on costs. However, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 2001
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v8i25.21685